How to Delegate a Lattice Basis

نویسندگان

  • David Cash
  • Dennis Hofheinz
  • Eike Kiltz
چکیده

We present a technique, which we call basis delegation, that allows one to use a short basis of a given lattice to derive a new short basis of a related lattice in a secure way. And since short bases for lattices essentially function like cryptographic trapdoors, basis delegation turns out to be a very powerful primitive. As the main application of our technique, we show how to construct hierarchical identity-based encryption (HIBE) that is secure, without random oracles, under the assumption that certain standard lattice problems are hard in the worst case. This construction and its variants constitute the first HIBE schemes from lattices, as well as the first lattice-based constructions of stateless signatures and identity-based encryption without random oracles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A classification of hull operators in archimedean lattice-ordered groups with unit

The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...

متن کامل

LATTICE-VALUED CATEGORIES OF LATTICE-VALUED CONVERGENCE SPACES

We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...

متن کامل

An Efficient Identity-based Signcryption from Lattice

Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality. In this paper, an efficient identity-based signcryption scheme from lattice was proposed. Our scheme based on Macciancio and Piekert’s trapdoor generation method and delegate algorithm for lattice. Our main idea is that establish the identity-based system master key via trapdoor gen...

متن کامل

A degree bound for the Graver basis of non-saturated lattices

Let $L$ be a lattice in $ZZ^n$ of dimension $m$. We prove that there exist integer constants $D$ and $M$ which are basis-independent such that the total degree of any Graver element of $L$ is not greater than $m(n-m+1)MD$. The case $M=1$ occurs precisely when $L$ is saturated, and in this case the bound is a reformulation of a well-known bound given by several authors. As a corollary, we show t...

متن کامل

Lattice-Based Hierarchical Inner Product Encryption

The notion of inner-product encryption (IPE), introduced by Katz, Sahai, and Waters at Eurocrypt 2008, is a generalization of identity-based encryption in which ciphertexts and secret keys are associated to vectors in some finite field. In an IPE scheme, a ciphertext can only be decrypted by a secret key if the vector associated with the latter is orthogonal to that of the ciphertext. In its hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009